On the exponential generating function of labelled trees
نویسندگان
چکیده
منابع مشابه
On Heights of Monotonically Labelled Binary Trees
A monotonically labelled binary tree is a binary tree with integer labels attached to the internal nodes in such a way that the labels along any path from the root are nondecreasing. If there is only one label, we are dealing with ordinary binary trees. Prodinger and Urbanek [6] introduced a variety of families of monotonically labelled trees and obtained enumerative results about many of them....
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولGenerating Trees on Multisets
Given a multiset M = V1 ∪ V2 ∪ · · · ∪ VC of n elements and a capacity function ∆ : [1, C] → [2, n− 1], we consider the problem of enumerating all unrooted trees T on M such that the degree of each vertex v ∈ Vi is bounded from above by ∆(i). The problem has a direct application of enumerating isomers of tree-like chemical graphs. We give an algorithm that generates all such trees without dupli...
متن کاملthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
Similarity measurement on leaf-labelled trees
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unordered or ordered and not necessarily carrying the same labels. The trees to be compared are first represented in the form of matrices whose entries are in the interval [O,1] and the actual comparison strategy then relies...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus. Mathématique
سال: 2021
ISSN: 1778-3569
DOI: 10.5802/crmath.108